A matching‐based context‐aware relay assignment scheme with power control in ad‐hoc wireless networks

In this paper, an emergency ad-hoc network based on cognitive radio is considered. It assumed that secondary users (SUs) are moving agents in which some fixed namely distributed relays (DRs), forward the data gathered by SUs to destination. The main goal maximize capacity of gathering destination with respect maximum interference tolerable primary (PU), and SU's DR's power constraints. A mixed-integer nonlinear model (MINLP) for joint relay assignment allocation shown. Given MINLP problems NP-Hard, a two interdependent solutions proposed achieve control. social-aware dynamic algorithm (SADRA) many-to-one matching proposed. matching, preference list DRs result mean opinion scores ranking roulette wheel selection random walk techniques applied eliminate same priorities. second phase, greedy adaptive non-convex problem converges component-wise minimal shown SADRA two-sided exchange stable matching. superior performance verified simulation results.